Shifted powers in binary recurrence sequences

نویسندگان

  • MICHAEL A. BENNETT
  • S. SIKSEK
چکیده

Let {uk} be a Lucas sequence. A standard technique for determining the perfect powers in the sequence {uk} combines bounds coming from linear forms in logarithms with local information obtained via Frey curves and modularity. The key to this approach is the fact that the equation uk = xn can be translated into a ternary equation of the form ay2 = bx2n + c (with a, b, c ∈ Z) for which Frey curves are available. In this paper we consider shifted powers in Lucas sequences, and consequently equations of the form uk = xn+c which do not typically correspond to ternary equations with rational unknowns. However, they do, under certain hypotheses, lead to ternary equations with unknowns in totally real fields, allowing us to employ Frey curves over those fields instead of Frey curves defined over Q. We illustrate this approach by showing that the quaternary Diophantine equation x2n ±6xn +1 = 8y2 has no solutions in positive integers x , y, n with x , n > 1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Small Prime Powers in the Fibonacci Sequence

It is shown that there are no non-trivial fifth-, seventh-, eleventh-, thirteenthor seventeenth powers in the Fibonacci sequence. For eleventh, thirteenthand seventeenth powers an alternative (to the usual exhaustive check of products of powers of fundamental units) method is used to overcome the problem of having a large number of independent units and relatively high bounds on their exponents...

متن کامل

Products of Prime Powers in Binary Recurrence Sequences Part I: The Hyperbolic Case, with an Application to the Generalized Ramanujan-Nagell Equation

We show how the Gelfond-Baker theory and diophantine approximation techniques can be applied to solve explicitly the diophantine equation C„ = wpTM< ■ ■ ■ p"< (where {G„}^_o is a binary recurrence sequence with positive discriminant), for arbitrary values of the parameters. We apply this to the equation x2 + k = p\' ■ ■ ■ pf', which is a generalization of the Ramanujan-Nagell equation x2 + 7 = ...

متن کامل

Products of Prime Powers in Binary Recurrence Sequences

We show how the Gelfond-Baker theory and diophantine approximation techniques can be applied to solve explicitly the diophantine equation G, = wp" ... p', (where (G,, }I='o is a binary recurrence sequence with positive discriminant), for arbitrary values of the parameters. We apply this to the equation x2 + k = ... ps', which is a generalization of the Ramanujan-Nagell equation x2 + 7 = 2Z. We ...

متن کامل

Generating Functions, Weighted and Non-Weighted Sums for Powers of Second-Order Recurrence Sequences

In this paper we find closed forms of the generating function ∞ ∑ k=0 U r nx , for powers of any non-degenerate second-order recurrence sequence, Un+1 = aUn+bUn−1, a +4b 6= 0, completing a study began by Carlitz [1] and Riordan [4] in 1962. Moreover, we generalize a theorem of Horadam [3] on partial sums involving such sequences. Also, we find closed forms for weighted (by binomial coefficients...

متن کامل

Some Properties of the Multiple Binomial Transform and the Hankel Transform of Shifted Sequences

In this paper, the author studies the multiple binomial transform and the Hankel transform of shifted sequences of an integer sequence, particularly a linear homogeneous recurrence sequence, and some of their properties.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015